The Index of grad f(x,y)

نویسنده

  • Alan H. Durfee
چکیده

Let f(x; y) be a real polynomial of degree d with isolated critical points, and let i be the index of grad f around a large circle containing the critical points. An elementary argument shows that jij d ? 1. In this paper we show that i maxf1; d ? 3g. We also show that if all the level sets of f are compact, then i = 1, and otherwise jij d R ? 1 where d R is the sum of the multiplicities of the real linear factors in the homogeneous term of highest degree in f. The technique of proof involves computing i from information at innnity. The index i is broken up into a sum of components i p;c corresponding to points p in the real line at innnity and limiting values c 2 Rf1g of the polynomial. The numbers i p;c are computed in three ways: geometrically, from a resolution of f(x; y), and from a Morsiication of f(x; y). The i p;c also provide a lower bound for the number of vanishing cycles of f(x; y) at the point p and value c.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reeections on the First Eigenvalue

The Laplacian is the second-order operator on functions given by (f) = ?div(grad(f)): As such, it is elliptic, self-adjoint, and is positive semi-deenite. It therefore has an L 2 basis of eigenfunctions and eigenvalues| that is, there are functions fg i g and non-negative numbers f i g such that 1 The collection of f i g's is called the spectrum of. The original interest in the Laplacian and it...

متن کامل

The index of gradf(x, y) (Revised version ∗)

Let f(x, y) be a real polynomial of degree d with isolated critical points, and let i be the index of grad f around a large circle containing the critical points. An elementary argument shows that |i| ≤ d − 1. In this paper we show that i ≤ max{1, d − 3}. We also show that if all the level sets of f are compact, then i = 1, and otherwise |i| ≤ dR − 1 where dR is the sum of the multiplicities of...

متن کامل

Connections between C(X) and C(Y), where Y is a subspace of X

In this paper, we introduce a method by which we can find a close connection between the set of prime $z$-ideals of $C(X)$ and the same of $C(Y)$, for some special subset $Y$ of $X$. For instance, if $Y=Coz(f)$ for some $fin C(X)$, then there exists a one-to-one correspondence between the set of prime $z$-ideals of $C(Y)$ and the set of prime $z$-ideals of $C(X)$ not containing $f$. Moreover, c...

متن کامل

Labeling Subgraph Embeddings and Cordiality of Graphs

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$.  For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...

متن کامل

Recurrences and explicit formulae for the expansion and connection coefficients in series of the product of two classical discrete orthogonal polynomials

Suppose that for an arbitrary function $f(x,y)$ of two discrete variables, we have the formal expansions. [f(x,y)=sumlimits_{m,n=0}^{infty }a_{m,n},P_{m}(x)P_{n}(y),] $$‎ ‎x^{m}P_{j}(x)=sumlimits_{n=0}^{2m}a_{m,,n}(j)P_{j+m-n}(x)‎,$$ ‎we find the coefficients $b_{i,j}^{(p,q,ell‎ ,‎,r)}$ in the expansion‎ $$‎ ‎x^{ell }y^{r},nabla _{x}^{p}nabla _{y}^{q},f(x,y)=x^{ell‎ ‎}y^{r}f^{(p,q)}(x,y) =sumli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997